#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9;
int n;
int a[N];
int tot;
bool cmp(int x, int y){
    return a[x] <= a[y];
}
bool vis[N];
bool judge[N];
void search(int i){
    for(int j = i; j <= n; j++){
        if(a[j] > a[i] && !vis[j]){
            judge[i] = true;
            vis[j] = true;
            tot--;
            search(i + 1);
            break;
        }
    }
}
int main(){
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    scanf("%d", &n);
    for(int i = 1; i <= n; i++)
        scanf("%d", &a[i]);
    sort(a + 1, a + n + 1);
    tot = n;
    search(1);
    printf("%d\n", tot);
    fclose(stdin);
    fclose(stdout);
    return 0;
}
